Upload
Featured Recent Articles Topics Login Upload

Search Results for 'log edges'

log edges published presentations and documents on DocSlides.

1 Finding Sparser Directed Spanners
1 Finding Sparser Directed Spanners
by yoshiko-marsland
Piotr. Berman, . Sofya. . Raskhodnikova. , . Ge...
Graph
Graph
by yoshiko-marsland
Sparsifiers. by. Edge-Connectivity and. Random S...
Graph Sparsifiers by Edge-Connectivity and
Graph Sparsifiers by Edge-Connectivity and
by olivia
Random Spanning Trees. Nick Harvey. U. Waterloo C&...
Randomized Algorithms for Cuts and
Randomized Algorithms for Cuts and
by jane-oiler
Colouring. David . Pritchard,. NSERC Post-doctora...
Graph Algorithms for Modern Data Models
Graph Algorithms for Modern Data Models
by alida-meadow
Ashish Goel. Stanford University. Joint work with...
Write some problems that you would
Write some problems that you would
by sherrill-nordquist
like me to cover on . Thursday. Asymptotic Notati...
Tight Bounds for Graph Problems in Insertion Streams
Tight Bounds for Graph Problems in Insertion Streams
by mitsue-stanley
Xiaoming. Sun and David P. Woodruff. Chinese Aca...
High Performance Linear System Solvers with Focus on Graph Laplacians
High Performance Linear System Solvers with Focus on Graph Laplacians
by giovanna-bartolotta
Richard Peng. Georgia Tech. Based on . recent wor...
Tight Bounds for Graph Problems in Insertion Streams
Tight Bounds for Graph Problems in Insertion Streams
by aaron
Xiaoming. Sun and David P. Woodruff. Chinese Aca...
High Performance Linear System Solvers with Focus on Graph
High Performance Linear System Solvers with Focus on Graph
by luanne-stotts
Richard Peng. Georgia Tech. Based on . recent wor...
Fast
Fast
by calandra-battersby
Distributed Algorithms. . for . (. Weakly) Conne...
Partitioned Elias-
Partitioned Elias-
by luanne-stotts
Fano. Indexes. Giuseppe Ottaviano. Rossano. . V...
What have we learnt about graph expansion in the new
What have we learnt about graph expansion in the new
by myesha-ticknor
millenium. ?. Sanjeev . Arora. Princeton Universi...
Computational Geometry Seminar - Distance Problems
Computational Geometry Seminar - Distance Problems
by alida-meadow
By Yoni Dabush. Topics:. Distance Problems:. Post...
Cover-Decomposition and
Cover-Decomposition and
by luanne-stotts
Polychromatic. Numbers. David Pritchard. Princet...
Tight Bounds for Graph Problems in Insertion Streams
Tight Bounds for Graph Problems in Insertion Streams
by debby-jeon
Xiaoming. Sun and David P. Woodruff. Chinese Aca...
Transitive-Closure
Transitive-Closure
by cheryl-pisano
Spanner of Directed Graphs. Kyomin. Jung. KAIS...
How do weights affects approximation algorithms?
How do weights affects approximation algorithms?
by cady
How do weights affects approximation algorithms?. ...
Lecture 13 Shortest Path
Lecture 13 Shortest Path
by kylie
Shortest Path problem. Given a graph G, edges. hav...
Pushkar Tripathi Georgia Institute of Technology
Pushkar Tripathi Georgia Institute of Technology
by carla
Approximability. of Combinatorial Optimization P...
93 Friday Oct 18
93 Friday Oct 18
by naomi
1Week Homework 5 Released Due October 26 1159PM o...
9/10/10 A. Smith; based on slides by E. Demaine, C. Leiserson, S. Raskhodnikova, K. Wayne
9/10/10 A. Smith; based on slides by E. Demaine, C. Leiserson, S. Raskhodnikova, K. Wayne
by phoebe-click
Adam Smith. Algorithm Design and Analysis. L. ECT...
CSE 332 Data Abstractions:
CSE 332 Data Abstractions:
by olivia-moreira
Disjoint Set Union-Find . and . Minimum Spanning ...
Nearly-Linear Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs
Nearly-Linear Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs
by tawny-fly
Richard Peng. Georgia Tech. In collaboration with...
Jorge Muñoz -Gama Josep
Jorge Muñoz -Gama Josep
by stefany-barnette
Carmona. Universitat. . Politècnica. de . Cat...
Multi-commodity Flows and Cuts in
Multi-commodity Flows and Cuts in
by myesha-ticknor
Polymatroidal. Networks. Chandra . Chekuri. Univ...
Mining Billion-Node
Mining Billion-Node
by pasty-toler
Graphs:. Patterns . and Algorithms. Christos Falo...
A Nearly Optimal Algorithm for Approximating Replacement Pa
A Nearly Optimal Algorithm for Approximating Replacement Pa
by danika-pritchard
Abhilasha Seth. CSCE 669. Replacement Paths. G = ...
Matrix Multiplication
Matrix Multiplication
by alida-meadow
and . Graph Algorithms. Uri Zwick. Tel Aviv Unive...
Shortest
Shortest
by trish-goza
. Paths. Algorithms. and Networks 2014/2015. Ha...
Pushkar
Pushkar
by marina-yarberry
. Tripathi. Georgia Institute of Technology. App...
Spanning and
Spanning and
by test
Sparsifying. Rajmohan Rajaraman. Northeastern Uni...
Markov Networks
Markov Networks
by danika-pritchard
Alan Ritter. Markov Networks. Undirected. graphi...